منابع مشابه
Low Power Elliptic Curve Cryptography
This M.S. thesis introduces new modulus scaling techniques for transforming a class of primes into special forms which enable efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of a scaled modulus. Our inversion algorithm exhibits superior performance to the Euc...
متن کاملCryptography for Ultra-Low Power Devices
Ubiquitous computing describes the notion that computing devices will be everywhere: clothing, walls and floors of buildings, cars, forests, deserts, etc. Ubiquitous computing is becoming a reality: RFIDs are currently being introduced into the supply chain. Wireless distributed sensor networks (WSN) are already being used to monitor wildlife and to track military targets. Many more application...
متن کاملCryptography in Ultra-Low Power Microcontroller MSP430
This article describes an implementation for the method from Texas Instruments for a random number generator in the ultra-low power microcontroller MSP430x5xx Families and the analysis of this generator in the concrete microcontroller MSP430f5438A. The generator may be used to generate numbers for cryptography security methods (for example in the cryptosystem Diffie-Hellman). A short theoretica...
متن کاملLow-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic
We introduce new modulus scaling techniques for transforming a class of primes into special forms which enables efficient arithmetic. The scaling technique may be used to improve multiplication and inversion in finite fields. We present an efficient inversion algorithm that utilizes the structure of scaled modulus. Our inversion algorithm exhibits superior performance to the Euclidean algorithm...
متن کاملThe Power of Negations in Cryptography
The study of monotonicity and negation complexity for Boolean functions has been prevalent in complexity theory as well as in computational learning theory, but little attention has been given to it in the cryptographic context. Recently, Goldreich and Izsak (2012) have initiated a study of whether cryptographic primitives can be monotone, and showed that one-way functions can be monotone (assu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2005
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/10/1/084